A Description-driven Community Detection
نویسندگان
چکیده
Traditional approaches to community detection, as studied by physicists, sociologists, and more recently computer scientists, aim at simply partitioning the social network graph. However, with the advent of online social networking sites, richer data has become available: beyond the link information, each user in the network is annotated with additional information, e.g., demographics, shopping behaviour, or interests. In this context it is therefore important to develop mining methods which can take advantage of all available information. In the case of community detection this means finding good communities (a set of nodes cohesive in the social graph) which are associated with good descriptions in terms of user information (node attributes). Having good descriptions associated to our models make them understandable by the domain experts, and thus more useful in real-world applications. Another requirement dictated by real-world applications, is to develop methods that can use, when available, any domain-specific background knowledge. In the case of community detection the background knowledge could be a vague description of the communities sought in a specific application, or some prototypical nodes (e.g., good customers in the past), that represent what the analyst is looking for (a community of similar users). Towards this goal, in this article we define and study the problem of finding a diverse set of cohesive communities with concise descriptions. We propose an effective algorithm that alternates between two phases: a hill-climbing phase producing (possibly overlapping) communities, and a description induction phase which uses techniques from supervised pattern set mining. Our framework has the nice feature of being able to build well-described cohesive communities starting from any given description or seed set of nodes, which makes it very flexible and easily applicable in real-world applications. Our experimental evaluation confirms that the proposed method discovers cohesive communities with concise descriptions in realistic and large online social networks such as DELICIOUS, FLICKR, and LASTFM.
منابع مشابه
Event-driven and Attribute-driven Robustness
Over five decades have passed since the first wave of robust optimization studies conducted by Soyster and Falk. It is outstanding that real-life applications of robust optimization are still swept aside; there is much more potential for investigating the exact nature of uncertainties to obtain intelligent robust models. For this purpose, in this study, we investigate a more refined description...
متن کاملFluid description of collisional current filamentation instability of a weakly ionized plasma in the presence of magnetic field
In this paper, the collisional filamentation instability of an electron beam-weakly magnetized and ionized plasma has been investigated in the presence of background plasma, using the fluid description. By describing the equilibrium configuration in the presence of binary collision terms between charged and neutral particles and using the local approximation method, the dispersion relation (DR)...
متن کاملShifting Mosaics in Semi-Steppe Rangelands Driven by Interactive Effect of Human Made Disturbances
Semi-steppe rangelands are a complex, highly dynamic and often multi-layered mosaic of grassland, shrubland, and intermediate communities. A few recent studies have explicitly or implicitly developed synthetic hypotheses about how interactive effects of human made disturbances initiate dynamic changes in plant community composition to cause a shifting mosaic of vegetation pattern across the lan...
متن کاملShifting Mosaics in Semi-Steppe Rangelands Driven by Interactive Effect of Human Made Disturbances
Semi-steppe rangelands are a complex, highly dynamic and often multi-layered mosaic of grassland, shrubland, and intermediate communities. A few recent studies have explicitly or implicitly developed synthetic hypotheses about how interactive effects of human made disturbances initiate dynamic changes in plant community composition to cause a shifting mosaic of vegetation pattern across the lan...
متن کاملOverlapping Community Detection in Social Networks Based on Stochastic Simulation
Community detection is a task of fundamental importance in social network analysis. Community structures enable us to discover the hidden interactions among the network entities and summarize the network information that can be applied in many applied domains such as bioinformatics, finance, e-commerce and forensic science. There exist a variety of methods for community detection based on diffe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013